Partially shared buffers with full or mixed priority
نویسندگان
چکیده
منابع مشابه
Partially Shared Buffers with Full or Mixed Priority
This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both clas...
متن کاملManagement of Partially Safe Buffers
AbstPactAhfe RAM is RAM which has been made as reliable as a disk. W e coI1sider the problem of buffer management in partially safe buffers, i.e., butlers which contain both safe RAM and volatile RAM. Buffer managemnt techniques for partially safe buffers explicitly consider the safety of memory in deciding which data to place in the buffer, where to place it, and when to copy updaks back to th...
متن کاملHeterogeneous packet processing in shared memory buffers
Packet processing increasingly involves heterogeneous requirements. We consider the well-known model of a shared memory switch with bounded-size buffer and generalize it in two directions. First, we consider unit-sized packets labeled with an output port and a processing requirement (i.e., packets with heterogeneous processing), maximizing the number of transmitted packets. We analyze the perfo...
متن کاملA time-shared machine repair problem with mixed spares under N-policy
The present investigation deals with a machine repair problem consisting of cold and warm standby machines. The machines are subject to breakdown and are repaired by the permanent repairman operating under N-policy. There is provision of one additional removable repairman who is called upon when the work load of failed machines crosses a certain threshold level and is removed as soon as the wor...
متن کاملAnalysis of Shared Memory Priority Queues with Two Discard Levels
n the ongoing work aimed at finding the way to transform the Internet from a single-class best effort service to providing a variety of service classes offering different performance guarantees (quality of service, QoS), simple coarse schemes and lightweight hardware support have become popular. Some such schemes are based on the concept of classification and performance level assignments at th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2011
ISSN: 1547-5816
DOI: 10.3934/jimo.2011.7.733